The freight allocation problem with all-units quantity-based discount: A heuristic algorithm
نویسندگان
چکیده
This paper studies a problem encountered by a buying office for one of the largest retail distributors in the world. An important task for the buying office is to plan the distribution of goods from Asia to various destinations across Europe. The goods are transported along shipping lanes by shipping companies, which offer different discount rates depending on the freight quantity. To increase the reliability of transportation, the shipper imposes a quantity limit on each shipping company on each shipping lane. To guarantee a minimum business volume, each shipping company requests a minimum total freight quantity over all lanes if it is contracted. The task involves allocating projected demand of each shipping lane to shipping companies subject to the above conditions such that the total cost is
منابع مشابه
OPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملPresenting a Joint Replenishment-location Model Under all-units Quantity Discount and Solving by Genetic Algorithm and Harmony Search Algorithm
In this paper a model is proposed for distribution centers location and joint replenishment of a distribution system that is responsible for orders and product delivery to distribution centers. This distribution centers are under limitedwarehouse space and this can determine amount of requirement product by considering proposed discount.The proposed model is develop to minimize total costs cons...
متن کاملA Multi-Periodic Multi-Product Inventory Control Problem with Discount: GA Optimization Algorithm
In this article, a finite horizon, multi product and multi period economic order quantity like seasonal items is considered where demand rate is deterministic and known but variable in each period. The order quantities of items come in batch sizes and the end of the period order quantity and, consequently, demand of customers are zero. In addition, storage space is constrained and the problem...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملSolving a New Multi-Period Mathematical Model of the Rail-Car Fleet Size and Car Utilization by Simulated Annealing
There is a significant interaction between sizing a fleet of rail cars and its utilization. This paper presents a new multi-period mathematical model and a solution procedure to optimize the rail-car fleet size and freight car allocation, wherein car demands, and travel times, are assumed to be deterministic, and unmet demands are backordered. This problem is considered NP-complete. In other wo...
متن کامل